A structural linearization principle for processes

In [11], an induction principle for processes was given which allows one to apply model-checking techniques to parameterized families of processes. A limitation of the induction principle is that it does not apply to the case in which one process depends directly upon a parameterized number of processes, which grows without bound. This would seem to preclude its application to families ofN processes interconnected in a star topology. Nonetheless, we show that if the dependency can be computed incrementally, then the direct dependency upon the parameterized number of processes may be re-expressed recursively in terms of a linear cascade of processes, yielding in effect a linearization of the inter-process dependencies and allowing the induction principle to apply.A previous version of this paper appears in the Proceedings of CAV 1993 (LNCS 697).     

L-Ascorbic acid in nonenzymatic reactions

The influence of the water content, molar ratio, time and temperature on the formation of nondialysable melanoidins produced by the interaction ofl-ascorbic acid and glycine has been studied. The isolated polymers have been characterized by spectrum analysis and fractionated using gel chromatography. The rate constants of the reaction for temperatures of 90°C, 100°C and 110°C have been calculated and are (0.84±0.29) x 10^?5 x s^?1, (1.33±0.14) x 10^?5 x s^?1 and (5.30±0.37) x 10^?5 x s^?1 respectively. The activation energy of the reaction has been determined to be 106.07±32.47 kJ/mol.     

Relay-Assisted Wireless Energy Transfer for Efficient Spectrum Sharing in Harsh Environments

International Journal of Wireless Information Networks - With exponential growth in the number of wireless devices and limited available spectrum, the problem of spectrum sharing remains in...     

Trimetallic PtCoFe Alloy Monolayer Superlattices as Bifunctional Oxygen‐Reduction and Ethanol‐Oxidation Electrocatalysts

A synthesis strategy for the preparation of trimetallic PtCoFe alloy nanoparticle superlattices is reported. Trimetallic PtCoFe alloy monolayer array of nanoparticle superlattices with a large density of high index facets and platinum‐rich surface are successfully prepared by coreduction of metal precursors in formamide solvent. The concentration of cetyl trimethyl ammonium bromide plays a vital role for the formation of a monolayer array of nanoparticle superlattices, while the size of nanoparticles is determined by NaI. The prepared monolayer array of nanoparticle superlattices is the superior catalyst for oxygen reduction reaction as well as for ethanol oxidation owing to their specific structural and compositional characteristics.     

NURBS-Enhanced Finite Element Method (NEFEM)

The development of NURBS-Enhanced Finite Element Method (NEFEM) is revisited. This technique allows a seamless integration of the CAD boundary representation of the domain and the finite element method (FEM). The importance of the geometrical model in finite element simulations is addressed and the benefits and potential of NEFEM are discussed and compared with respect to other curved finite element techniques.     

Linear complete differential resultants and the implicitization of linear DPPEs

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n$n$ linear differential polynomial parametric equations in n−1$n-1$ differential parameters. We give necessary conditions to ensure properness of the system of differential polynomial parametric equations.     

Deployment algorithms for a power‐constrained mobile sensor network

This paper presents distributed coverage algorithms for mobile sensor networks in which agents have limited power to move. Rather than making use of a constrained optimization technique, our approach accounts for power constraints by assigning non‐homogeneously time‐varying regions to each robot. This leads to novel partitions of the environment into limited‐range, generalized Voronoi regions. The motion control algorithms are then designed to ascend the gradient of several types of locational optimization functions. In particular, the objective functions reflect the global energy available to the group and different coverage criteria. As we discuss in the paper, this has an effect on limiting each agent's velocity to save energy and balance its expenditure across the network. Copyright © 2009 John Wiley & Sons, Ltd.     

Pool Evolution: A Parallel Pattern for Evolutionary and Symbolic Computing

We introduce a new parallel pattern derived from a specific application domain and show how it turns out to have application beyond its domain of origin. The pool evolution pattern models the parallel evolution of a population subject to mutations and evolving in such a way that a given fitness function is optimized. The pattern has been demonstrated to be suitable for capturing and modeling the parallel patterns underpinning various evolutionary algorithms, as well as other parallel patterns typical of symbolic computation. In this paper we introduce the pattern, we discuss its implementation on modern multi/many core architectures and finally present experimental results obtained with FastFlow and Erlang implementations to assess its feasibility and scalability.     

From Autonomy to Cooperative Traded Control of Humanoid Manipulation Tasks with Unreliable Communication

In this paper, we present our system design, operational procedure, testing process, field results, and lessons learned for the valve-turning task of the DARPA Robotics Challenge (DRC). We present a software framework for cooperative traded control that enables a team of operators to control a remote humanoid robot over an unreliable communication link. Our system, composed of software modules running on-board the robot and on a remote workstation, allows the operators to specify the manipulation task in a straightforward manner. In addition, we have defined an operational procedure for the operators to manage the teleoperation task, designed to improve situation awareness and expedite task completion. Our testing process, consisting of hands-on intensive testing, remote testing, and remote practice runs , demonstrates that our framework is able to perform reliably and is resilient to unreliable network conditions. We analyze our approach, field tests, and experience at the DRC Trials and discuss lessons learned which may be useful for others when designing similar systems.